#include<stdio.h>

void merge_sort(int *q,int l,int r);

int main()
{
	int n=0;
	scanf("%d",&n);
	int q[n];
	for(int i=0;i<n;i++)
	{
		scanf("%d",&q[i]);
	}
	merge_sort(q,0,n-1);
	for(int i=0;i<n;i++)
	{
		printf("%d ",q[i]);
	}
	return 0;
}

void merge_sort(int *q,int l,int r)
{
	if(l>=r)
	{
		return;
	}
	int mid=(l+r)/2;
	merge_sort(q,l,mid);
	merge_sort(q,mid+1,r);
	int i=l,j=mid+1,k=0;
	int tmp[r-l+1]={0};
	while(i<=mid&&j<=r)
	{
		if(q[i]<=q[j])
		{
			tmp[k++]=q[i++];
		}
		else
		{
			tmp[k++]=q[j++];
		}
	}
	while(i<=mid)
	{
		tmp[k++]=q[i++];
	}
	while(j<=r)
	{
		tmp[k++]=q[j++];
	}
	for(i=l,j=0;i<=r;i++,j++)
	{
		q[i]=tmp[j];
	}
}
